Contextual Grammars as Generative Models of Natural Languages
نویسندگان
چکیده
The paper discusses some classes of contextual grammars--mainly those with "maximal use of selectors"--giving some arguments that these grammars can be considered a good model for natural language syntax. A contextual grammar produces a language starting from a finite set of words and iteratively adding contexts to the currently generated words, according to a selection procedure: each context has associated with it a selector, a set of words; the context is adjoined to any occurrence of such a selector in the word to be derived. In grammars with maximal use of selectors, a context is adjoined only to selectors for which no superword is a selector. Maximality can be defined either locally or globally (with respect to all selectors in the grammar). The obtained families of languages are incomparable with that of Chomsky context-free languages (and with other families of languages that contain linear languages and that are not "too large"; see Section 5) and have a series of properties supporting the assertion that these grammars are a possible adequate model for the syntax of natural languages. They are able to straightforwardly describe all the usual restrictions appearing in natural (and artificial) languages, which lead to the non-context-freeness of these languages: reduplication, crossed dependencies, and multiple agreements; however, there are center-embedded constructions that cannot be covered by these grammars. While these assertions concern only the weak generative capacity of contextual grammars, some ideas are also proposed for associating a structure to the generated words, in the form of a tree, or of a dependence relation (as considered in descriptive linguistics and also similar to that in link grammars).
منابع مشابه
Contextual Grammars versus Natural Languages
We continue here the investigations concerning the relevance of certain classes of contextual grammars (internal contextual grammars with maximal use of selectors) as generative models of natural languages. We discuss the mildly context-sensitiveness property (especially the semilinearity and related properties), the possibility to cover certain constructions speci c to natural languages, as we...
متن کاملk-Local Internal Contextual Grammars
In this paper we propose a generalization of the local internal contextual grammars, introduced by Ilie in 1997, namely the k-local internal contextual grammars. These grammars are, in fact, classical internal contextual grammars, but their only permitted derivations are those that can be described in a restricted manner (that depends on the number k). Within this formalism we define different ...
متن کاملComputational properties of Unification Grammars
There is currently considerable interest among computational linguists in grammatical formalisms with highly restricted generative power. This is based on the argument that a grammar formalism should not merely be viewed as a notation, but as part of the linguistic theory. It is now generally accepted that CFGs lack the generative power needed for this purpose. Unification grammars have the abi...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملModeling Graph Languages with Grammars Extracted via Tree Decompositions
Work on probabilistic models of natural language tends to focus on strings and trees, but there is increasing interest in more general graph-shaped structures since they seem to be better suited for representing natural language semantics, ontologies, or other varieties of knowledge structures. However, while there are relatively simple approaches to defining generative models over strings and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computational Linguistics
دوره 24 شماره
صفحات -
تاریخ انتشار 1998